package regEx.finiteAutomata;
/**
 *
 * Transitions for the Finite Automata
 */

import java.util.ArrayList;

public class Transition {

    /**
     * Transition value:
     * can be:
     * 	a   :   b   :   c    :   'e' (epsilon)
     */
    private char transitionValue;

    private State toState;

    /**
     * Boolean value to track which edges were visited when converting this transitions NFA to adjacencyMatrix
     */
    private boolean visited;

    public Transition(char aChar, State toState) {
        this.transitionValue = aChar;
        this.visited = false;
        this.toState = toState;
    }

    public char getTransitionValue() {
        return transitionValue;
    }

    public void setTransitionValue(char transitionValue) {
        this.transitionValue = transitionValue;
    }

    public State getToState() {
        return toState;
    }

    public void setToState(State toState) {
        this.toState = toState;
    }

    public boolean isVisited() {
        return visited;
    }

    public void setVisited(boolean visited) {
        this.visited = visited;
    }
}
